Improved Least-Squares Progressive Iterative Approximation for Tensor Product Surfaces

نویسندگان

چکیده

Geometric iterative methods, including progressive approximation and geometric interpolation are efficient for fitting a given data set. With the development of big technology, number points has become massive, least-squares (LSPIA) is generally applied to fit mass data. Combining Schulz method calculating Moore–Penrose generalized inverse matrix with traditional LSPIA method, this paper presents an accelerated tensor product surfaces shows that corresponding surface sequence converged The format non-stationary convergence rate increased rapidly as iteration increased. Some numerical examples provided illustrate proposed faster rate.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Progressive iterative approximation for triangular Bézier surfaces

Recently, for the sake of fitting scattered data points, an important method based on the PIA (progressive iterative approximation) property of the univariate NTP (normalized totally positive) bases has been effectively adopted. We extend this property to the bivariate Bernstein basis over a triangle domain for constructing triangular Bézier surfaces, and prove that this good property is satisf...

متن کامل

The Convergence of Least-Squares Progressive Iterative Approximation with Singular Iterative Matrix

Developed in [Deng and Lin, 2014], Least-Squares Progressive Iterative Approximation (LSPIA) is an efficient iterative method for solving B-spline curve and surface least-squares fitting systems. In [Deng and Lin 2014], it was shown that LSPIA is convergent when the iterative matrix is nonsingular. In this paper, we will show that LSPIA is still convergent even the iterative matrix is singular.

متن کامل

Progressive and iterative approximation for least squares B-spline curve and surface fitting

The progressive and iterative approximation (PIA) method is an efficient and intuitive method for data fitting. However, in the classical PIA method, the number of the control points is equal to that of the data points. It is not feasible when the number of data points is very large. In this paper, we develop a new progressive and iterative approximation for least square fitting (LSPIA). LSPIA ...

متن کامل

Iterative Reweighted Least Squares ∗

Describes a powerful optimization algorithm which iteratively solves a weighted least squares approximation problem in order to solve an L_p approximation problem. 1 Approximation Methods of approximating one function by another or of approximating measured data by the output of a mathematical or computer model are extraordinarily useful and ubiquitous. In this note, we present a very powerful ...

متن کامل

Iterative Least-Squares Decoding of Analog Product Codes

We define analog product codes as a special case of analog parallel concatenated codes. These codes serve as a tool to get some more insight into the convergence of “Turbo” decoding. We prove that the iterative “Turbo”-like decoding of analog product codes indeed is an estimation in the least-squares sense and thus correspond to the optimum maximum-likelihood decoding.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11030670